The Choice-coordination Problem: Notes for a Correctness Proof
ثبت نشده
چکیده
Rabin's Choice-coordination algorithm 5] allows a number of identical processes to agree on a choice between two alternatives while nevertheless executing asynchronously. The algorithm is analysed here with techniques based on prob-abilistic predicate transformers 3], in particular applying invariants and variants as set out in 2], and using a probabilistic temporal logic.
منابع مشابه
A Model Slicing Method for Workflow Verification
Workflow systems increase productivity and quality of service; however, defects in a workflow model may have severe consequences. While model checking techniques can be used to verify the correctness of a workflow model, these techniques typically suffer from the state explosion problem. We propose a model slicing algorithm with a formal proof to address this problem. The algorithm is integrate...
متن کاملProducing Proofs from an Arithmetic Decision Procedure in Elliptical LF
Software that can produce independently checkable evidence for the correctness of its output has received recent attention for use in certifying compilers and proofcarrying code. CVC (“a Cooperating Validity Checker) is a proof-producing validity checker for a decidable fragment of first-order logic enriched with background theories. This paper describes how proofs of valid formulas are produce...
متن کاملMechanised Wire-wise Verification of Handel-C Synthesis
The compilation of Handel-C programs into net-list descriptions of hardware components has been extensively used in commercial tools but never formally verified. In this paper, we first introduce an extension of the compilation schema that allows the synthesis of the prioritised choice construct. Then we present a variation of the existing semantic model for Handel-C compilation that is amenabl...
متن کاملSome notes on ``Common fixed point of two $R$-weakly commuting mappings in $b$-metric spaces"
Very recently, Kuman et al. [P. Kumam, W. Sintunavarat, S. Sedghi, and N. Shobkolaei. Common Fixed Point of Two $R$-Weakly Commuting Mappings in $b$-Metric Spaces. Journal of Function Spaces, Volume 2015, Article ID 350840, 5 pages] obtained some interesting common fixed point results for two mappings satisfying generalized contractive condition in $b$-metric space without the assumption of the...
متن کاملTowards Proof Generating Compilers
Correctness of compilation is important for the reliability of software. New techniques to guarantee correctness do not verify the compiler itself, but check for each compiled program whether it is correctly translated. Following these ideas, we developed an approach in which checking is realized as proof checking within a formal specification and verification framework. Based on formal specifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996